Efficient Algorithms for Eulerian Extension and Rural Postman
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Eulerian Extension and Rural Postman
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-weighted, (multi-)graph Eulerian by adding a minimum-cost set of arcs. These problems have natural applications in scheduling and arc routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard WeightedMultigraph Eulerian Extension problem ...
متن کاملEfficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in scheduling and routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard Weighted Multigraph Eulerian Extension is fixed-parameter tractable with respect ...
متن کاملA New View on Rural Postman Based on Eulerian Extension and Matching
We provide a new characterization of the NP-hard arc routing problem Rural Postman in terms of a constrained variant of minimum-weight perfect matching on bipartite graphs. To this end, we employ a parameterized equivalence between Rural Postman and Eulerian Extension, a natural arc addition problem in directed multigraphs. We indicate the NP-hardness of the introduced matching problem. In part...
متن کاملNew heuristic algorithms for the windy rural postman problem
In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...
متن کاملSolving the Rural Postman Problem by Memetic Algorithms
The Rural Postman Problem (RPP), as an Arc Routing Problem (ARP), consists of determining a minimum cost tour of a specified arc set of a graph (G=(V,A)) but, with the particularity that only a subset R (R ⊆ A) of arcs is required to be traversed at least once. RPPs are applied in a variety of practical contexts, namely the industrial interesting case of path optimization for components cutting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/110834810